Mapping sequences by parts
نویسندگان
چکیده
منابع مشابه
Distinct Parts Partitions without Sequences
Partitions without sequences of consecutive integers as parts have been studied recently by many authors, including Andrews, Holroyd, Liggett, and Romik, among others. Their results include a description of combinatorial properties, hypergeometric representations for the generating functions, and asymptotic formulas for the enumeration functions. We complete a similar investigation of partition...
متن کاملEnumeration of Sequences Constrained by the Ratio of Consecutive Parts
Recurrences are developed to enumerate any family of nonnegative integer sequences λ = (λ1, . . . , λn) satisfying the constraints: λ1 a1 ≥ λ2 a2 ≥ · · · ≥ λn−1 an−1 ≥ λn an ≥ 0, for a given constraint sequence a = [a1, . . . , an] of positive integers. They are applied to derive new counting formulas, to reveal new relationships between families, and to give simple proofs of the truncated lect...
متن کاملMapping isochores by entropic segmentation of long genome sequences
Analytical DNA ultracentrifugation revealed that many eukaryotic genomes are mosaics of isochores: long DNA segments (>300 kb) relatively homogeneous in GC content (above a size of 3 kb) when compared to the large heterogeneity in the entire genome [1,2]. Important genome features are dependent on such isochore structure –i.e. genes are found predominantly in the GC-richest isochore classes. Ho...
متن کاملAnchoring Symbols by Mapping Sequences of Distance Measurements: Experimental Results
In this paper we present an approach to symbol anchoring that is based on mapping sequences of distance measurements from simple sensors. The sensory space of the mobile robot is pre-structured according to its experiences when it first moves around in unexplored environments. Such pre-structuring depends not only on environmental features, but also on the type of behaviour the robot exhibits. ...
متن کاملImproved Alignment of Protein Sequences Based on Common Parts
In the last twenty years, protein databases have been growing exponentially. To speed up the search, heuristic approaches have been proposed and their accuracy has been steadily growing, but exact search is still needed in some cases. The only exact search algorithm remains SSEARCH (or it’s clones) which sequentially scans database of protein sequences, and performs full alignment against each ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithms for Molecular Biology
سال: 2007
ISSN: 1748-7188
DOI: 10.1186/1748-7188-2-11